Jacobian Nullwerte, Periods and Symmetric Equations for Hyperelliptic Curves
نویسنده
چکیده
We propose a solution to the hyperelliptic Schottky problem, based on the use of Jacobian Nullwerte and symmetric models for hyperelliptic curves. Both ingredients are interesting on its own, since the first provide period matrices which can be geometrically described, and the second have remarkable arithmetic properties.
منابع مشابه
On the Torelli Problem and Jacobian Nullwerte in Genus Three
We give a closed formula for recovering a non-hyperelliptic genus three curve from its period matrix, and derive some identities between Jacobian Nullwerte in dimension three.
متن کاملModular equations for hyperelliptic curves
We define modular equations describing the `-torsion subgroups of the Jacobian of a hyperelliptic curve. Over a finite base field, we prove factorization properties that extend the well-known results used in Atkin’s improvement of Schoof’s genus 1 point counting algorithm.
متن کاملFast Arithmetic In Jacobian Of Hyperelliptic Curves Of Genus 2 Over GF(p)
In this paper, we suggest a new fast transformation for a divisor addition for hyperelliptic curves. The transformation targets the Jacobian of genus-2 curves over odd characteristic fields in projective representation. Compared to previously published results, the modification reduces the computational complexity and makes hyperelliptic curves more attractive for applications.
متن کاملSeshadri Constants on Jacobian of Curves
We compute the Seshadri constants on the Jacobian of hyperelliptic curves, as well as of curves with genus three and four. For higher genus curves we conclude that if the Seshadri constants of their Jacobian are less than 2, then the curves must be hyperelliptic.
متن کاملGenus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
The use of elliptic and hyperelliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test whether the Jacobian – over a finite field Fq – of a hyperelliptic curve of the form Y 2 = X + aX + bX (with a, b ∈ Fq) has a large prime factor. His approach is to obtain candidates for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006